An Improved Construction Method for MIHCs on Cycle Composition Networks

Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC’s, on interconnection networks are published. In this paper, using an improved construction method, we obtain MIHC’s on cycle composition networks with a much weaker condition than the known result. In fact, we established the existence of MIHC’s in the cycle composition networks and the result is optimal in the sense that the number of MIHC’s we constructed is maximal. Keywords—Hamiltonian cycle, k-ary n-cube, cycle composition networks, mutually independent.